K-Connected Cores Computation in Large Dual Networks
نویسندگان
چکیده
منابع مشابه
Rhythmogenic neuronal networks, pacemakers, and k-cores
Neuronal networks are controlled by a combination of the dynamics of individual neurons and the connectivity of the network that links them together. We study a minimal model of the preBotzinger complex, a small neuronal network that controls the breathing rhythm of mammals through periodic firing bursts. We show that the properties of a such a randomly connected network of identical excitatory...
متن کاملInterference Minimization in k-Connected Wireless Networks
Given a set of positions for wireless nodes, the kconnected interference minimization problem seeks to assign a transmission radius to each node such that the resulting network is k-connected and the maximum interference is minimized. We show there exist sets of n points on the line for which any k-connected network has maximum interference Ω( √ kn). We present polynomial-time algorithms that a...
متن کاملExotic phase transitions of k-cores in clustered networks
The giant k-core-maximal connected subgraph of a network where each node has at least k neighbors-is important in the study of phase transitions and in applications of network theory. Unlike Erdős-Rényi graphs and other random networks where k-cores emerge discontinuously for k≥3, we show that transitive linking (or triadic closure) leads to 3-cores emerging through single or double phase trans...
متن کاملEnumerating k-Vertex Connected Components in Large Graphs
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network topology analysis. Most of existing cohesive subgraph metrics can guarantee good structural properties but may cause the free-rider effect. Here, by free-rider effect, we mean that some irrelevant subgraphs are combi...
متن کاملK3,k-MINORS IN LARGE 7-CONNECTED GRAPHS
It is shown that for any positive integer k there exists a constant N = N(k) such that every 7-connected graph of order at least N contains K3,k as a minor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science and Engineering
سال: 2018
ISSN: 2364-1185,2364-1541
DOI: 10.1007/s41019-018-0078-0